An isoperimetric problem for three-dimensional parallelohedra
نویسندگان
چکیده
The aim of this note is to investigate isoperimetric-type problems for $3$-dimensional parallelohedra; that is, convex polyhedra whose translates tile the Euclidean space. Our main result states among parallelohedra with unit volume one minimal mean width regular truncated octahedron.
منابع مشابه
An isoperimetric problem for point interactions
Questions about geometrical configurations which lead to extremal value of a spectral quantity represent a classical topic in mathematical physics; recall the Faber-Krahn inequality [Fa, Kr], the PPW-conjecture proved by Ashbaugh and Benguria [AB], and numerous other examples. A particular place in this list is occupied by the Dirichlet problem for the Laplacian in annular strips and their high...
متن کاملAn ACO algorithm for one-dimensional cutting stock problem
The one-dimensional cutting stock problem, has so many applications in lots of industrial processes and during the past few years has attracted so many researchers’ attention all over the world. In this paper a meta-heuristic method based on ACO is presented to solve this problem. In this algorithm, based on designed probabilistic laws, artificial ants do select various cuts and then select the...
متن کاملRemarks on an Edge Isoperimetric Problem
Among all collections of a given number of k-element subsets of an n-element groundset find a collection which maximizes the number of pairs of subsets which intersect in k − 1 elements. This problem was solved for k = 2 by Ahlswede and Katona, and is open for k > 2. We survey some linear algebra approaches which yield to estimations for the maximum number of pairs, and we present a new and sho...
متن کاملAn Improved Upper Bound for the Three Dimensional Dimer Problem
Let n be even and denote by f (n) the number of domino tilings of a cube of side n. The three dimensional dimer problem is to determine the limit`3 := limn!1(log f (n))=n 3 (which is known to exist). The best previously known upper bound was found by Minc and is 1=12 log 6! = 0:54827:::. In this paper we improve this bound to 0.463107.
متن کاملAn Eecient Algorithm for the Three-dimensional Diameter Problem
We give a deterministic algorithm for computing the diameter of an n-point set in three dimensions with O(n log 2 n) running time. This bound matches the best previous algorithm of Ramos 18]. However, our algorithm applies another technique and is simpler.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 2022
ISSN: ['1945-5844', '0030-8730']
DOI: https://doi.org/10.2140/pjm.2022.316.169